Go - Shops vs . No - Shops : Evidence and Implications

نویسندگان

  • Louis Kaplow
  • Steven Shavell
  • Guhan Subramanian
  • Leo Strine
  • Ranjan Ahuja
چکیده

Go-shop provisions have changed the way in which private equity firms execute public-company buyouts. While there has been considerable practitioner commentary on go-shops in the three years since they first appeared, this paper presents the first systematic empirical evidence on this new dealmaking technology. Contrary to the claims of prior commentators, I find that: (1) goshops yield more search in aggregate (preand post-signing) than the traditional no-shop route; (2) “pure” go-shop deals, in which there is no pre-signing canvass of the marketplace, yield a higher bidder 17% of the time; and (3) target shareholders receive approximately 5% higher returns through the pure go-shop process relative to the no-shop route. I also find no postsigning competition in go-shop management buyouts (MBOs), consistent with practitioner wisdom that MBO’s give incumbent managers a significant advantage over other potential buyers. Taken as a whole, these findings suggest that the Delaware courts should generally permit go-shops as a means of satisfying a sell-side board’s Revlon duties, but should pay close attention to their precise structure, particularly in the context of go-shop MBOs. JEL Classifications: D44, G14, G32, G34, K22, L14 Go-Shops vs. No-Shops: Evidence and Implications

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and scheduling no-idle hybrid flow shop problems

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

متن کامل

Locating Repairshops in a Stochastic Environment Locating Repairshops in a Stochastic Environment

In this paper we consider a repair shop location problem with uncertainties in demand. New local repair shops have to be opened at a number of locations. At these local repair shops, customers arrive with broken, but repairable, items. Customers go to the nearest open repair shop. Since they want to leave as soon as possible, a (small) inventory of working items is kept at the repair shops. A c...

متن کامل

شناسایی عوامل مؤثر در افزایش درآمد حاصل از مغازه‌های وقفی بازار تهران

The increase of incomes in Irans endowents (Waqfs) could have an outstanding role in providing a part of public services needed in the society and betterment of income distribution and as a result endowers and benefactors would play a part in meeting greater portion of these services. Materializing this objective requires an all-out development of endowment (Waqt) services as wall as better ope...

متن کامل

No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods

In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...

متن کامل

Locating repair shops in a stochastic environment

In this paper we consider a repair shop location problem with uncertainties in demand. New repair shops have to be opened at a number of locations. At these local repair shops, customers arrive with broken, but repairable, items. Customers go to the nearest open repair shop. Since they want to leave as soon as possible, an inventory of working items is kept at the repair shops. A customer immed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007